Minimum wirelength of hypercubes into n-dimensional grid networks

نویسندگان

  • Indra Rajasingh
  • Micheal Arockiaraj
  • Bharati Rajan
  • Paul D. Manuel
چکیده

In the paper [Exact wirelength of hypercube on a grid, Discrete Applied Mathematics, 157 (2009), no. 7, 1486 1495], the minimum wirelength of an -dimensional hypercube into a 2b2c £ 2d2e grid has been obtained. In this paper, we obtain the same when the 2b2c £ 2d2e rectangular grid is replaced by a generalized grid of size 21 £ 22 £ ¢ ¢ ¢ £ 2 where 1 + 2 + +  = , 1 · 2 · ¢ ¢ ¢ · .

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Exact wirelength of hypercubes on a grid

Grid embeddings are used not only to study the simulation capabilities of a parallel architecture but also to design its VLSI layout. In addition to dilation and congestion, wirelength is an important measure of an embedding. There are very few papers in the literature which provide the exact wirelength of grid embedding. As far as the most versatile architecture hypercube is concerned, only ap...

متن کامل

Wirelength of 1-fault hamiltonian graphs into wheels and fans

In this paper we obtain a fundamental result to find the exact wirelength of 1-fault hamiltonian graphs into wheels and fans. Using this result we compute the exact wirelength of circulant graphs, generalized petersen graphs, augmented cubes, crossed cubes, mőbius cubes, locally twisted cubes, twisted cubes, twisted n-cubes, generalized twisted cubes, hierarchical cubic networks, alternating gr...

متن کامل

Embedding of Hypercube into Cylinder

Task mapping in modern high performance parallel computers can be modeled as a graph embedding problem, which simulates the mapping as embedding one graph into another and try to find the minimum wirelength for the mapping. Though embedding problems have been considered for several regular graphs, such as hypercubes into grids, binary trees into grids, et al, it is still an open problem for hyp...

متن کامل

Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength

We consider the problem of embedding hypercubes into cylinders to minimize the wirelength. Further we show that the edge isoperimetric problem solves the wirelength problem of regular graphs and in particular hypercubes into triangular snakes and caterpillars.

متن کامل

Exact Wirelength of Embedding the Hypercubes into Cycle-of-ladders

Hypercubes are a very popular model for parallel computation because of their regularity and the relatively small number of interprocessor connections. In this paper, we present an algorithm to compute the exact wirelength of embedding the hypercubes into cycle-of-ladders and prove its correctness.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Process. Lett.

دوره 112  شماره 

صفحات  -

تاریخ انتشار 2012